Interpolating Value Functions in Discrete Choice Dynamic Programming Models
نویسنده
چکیده
Structural discrete choice dynamic programming models have been shown to be a valuable tool for analyzing a wide range of economic behavior. A major limitation on the complexity and applicability of these models is the computational burden associated with computing the high dimensional integrals that typically characterize an agents decision rules. This paper develops a regression based approach to interpolating value functions during the solution of dynamic programming models that alleviates this burden. This approach is suitable for use in models that incorporate unobserved state variables that are serially correlated across time and correlated across choices within a time period. The key assumption is that one unobserved state variable, or error term, in the model is distributed extreme value. Additional error terms that allow for correlation between unobservables across time or across choices within a given time period may be freely incorporated in the model. Value functions are simulated at a fraction of the state space and interpolated at the remaining points using a new regression function based on the extreme value closed form solution for the expected maxima of the value function. This regression function is well suited for use in models with large choice sets and complicated error structures. The performance of the interpolation method appears to be excellent, and it greatly reduces the computational burden of estimating the parameters of a dynamic programming model. The views expressed in this paper are those of the author and may not represent the views of the U.S. Bureau of Labor Statistics. Contact information: Email: [email protected]. Phone: (202) 691-6593. Fax: (202) 691-6583. Bureau of Labor Statistics, Postal Square Building, Room 3105 MC 204, 2 Massachusetts Avenue N.E., Washington, D.C. 20212-0001.
منابع مشابه
A dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملEstimating Discrete-Continuous Choice Models: The Endogenous Grid Method with Taste Shocks
We present a fast and accurate computational method for solving and estimating a class of dynamic programming models with discrete and continuous choice variables. The solution method we develop for structural estimation extends the endogenous gridpoint method (EGM) to discrete-continuous (DC) problems. Discrete choices can lead to kinks in the value functions and discontinuities in the optimal...
متن کاملIdentification of the Distribution of Random Coefficients in Static and Dynamic Discrete Choice Models
We show that the distributions of random coefficients in various discrete choice models are nonparametrically identified. Our identification results apply to static discrete choice models including binary logit, multinomial logit, nested logit, and probit models as well as to dynamic programming discrete choice models. In these models the only key condition we need to verify for identification ...
متن کاملThe endogenous grid method for discrete-continuous dynamic choice models with (or without) taste shocks
We present a fast and accurate computational method for solving and estimating a class of dynamic programming models with discrete and continuous choice variables. The solution method we develop for structural estimation extends the endogenous grid-point method (EGM) to discrete-continuous (DC) problems. Discrete choices can lead to kinks in the value functions and discontinuities in the optima...
متن کاملBayesian Estimation of Dynamic Discrete Choice Models
We propose a new estimator for dynamic programming discrete choice models. Our estimation method combines the Dynamic Programming algorithm with a Bayesian Markov Chain Monte Carlo algorithm into one single Markov Chain algorithm that solves the dynamic programming problem and estimates the parameters at the same time. Our key innovation is that during each solution-estimation iteration both th...
متن کامل